Entailment with Conditional Equality Constraints
نویسندگان
چکیده
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally, for comparison, we study a natural extension of conditional equality constraints.
منابع مشابه
The Complexity of Entailment Problems over Conditional Equality Constraints ?
Equality constraints (a.k.a. unification constraints) have widespread use in static program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow more accurate analyses and more expressive type systems. In this paper, we present a complete complexity characterization of the various entailmen...
متن کاملEntailment with Conditional Equality Constraints ( Extended
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints and for a nat...
متن کاملProbabilistic Default Reasoning with Strict and Defeasible Conditional Constraints Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints
We present an approach to reasoning about statistical knowledge and degrees of belief, which is based on a combination of probabilistic reasoning from conditional constraints and default reasoning from conditional knowledge bases. More precisely, we generalize the notions of Pearl's entailment in system , Lehmann's lexicographic entailment, and Geffner's conditional entailment to strict and def...
متن کاملEntailment of Finite Domain Constraints Entailment of Finite Domain Constraints
Using a glass-box theory of nite domain constraints, FD, we show how the entailment of user-deened constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the deenition of arithmetical constraints, as well as non-trivial symbolic constraints, that are no...
متن کاملProbabilistic Logic Programming under Inheritance with Overriding
We present probabilistic logic programming un der inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment by adding inheritance with overriding. This is done by using recent approaches to probabilistic de fault reasoning with conditional constraints. We analy...
متن کامل